منابع مشابه
Completion for Unification
Unification in equational theories [33] is at the very heart of theorem proving [25] and logic programming [S] but has the main drawback of being undecidable [30]. One is thus in a situation to find specific unification algorithms for equational theories of interest: major examples are the empty theory (no axioms) [lo, 271, associative commutative theories [29, 191 and associativity theory [22,...
متن کاملA Completion-Based Method for Mixed Universal and Rigid E-Unification
We present a completion-based method for handling a new version of E-unification, called “mixed” E-unification, that is a combination of the classical “universal” E-unification and “rigid” E-unification. Rigid E-unification is an important method for handling equality in Gentzen-type first-order calculi, such as free-variable semantic tableaux or matings. The performance of provers using E-unif...
متن کاملFuzzy completion time for alternative stochastic networks
In this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. In other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of network. Then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (TFN). This paper com...
متن کاملUnification and Default Unification
Unification of (typed) feature structures is an important tool for capturing linguistic generalizations. It is the core of a family of linguistic formalisms, it has been applied in phonology, morphology, syntax, and semantics, and is dominant in most linguistically informed work in natural language processing. Unification monotonically merges information. Default unification provides a non-mono...
متن کاملUnification without Unification
The logarithmic running of the gauge couplings α1, α2 and α3, indicates that they may unify at some scale MGUT ∼ 10 GeV. This is often taken to imply that the standard model gauge group is embedded into some larger simple group in which quarks and leptons are placed in the same multiplet. These models have generic features, such as proton decay, and generic problems, namely the splitting of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90182-2